Covering Congruences in Higher Dimensions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Higher congruences between modular forms

It is well-known that two modular forms on the same congruence subgroup and of the same weight, with coefficients in the integer ring of a number field, are congruent modulo a prime ideal in this integer ring, if the first B coefficients of the forms are congruent modulo this prime ideal, where B is an effective bound depending only on the congruence subgroup and the weight of the forms. In thi...

متن کامل

Higher Congruences Between Modular Forms

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

متن کامل

An approach to covering dimensions ∗

Using certain ideas connected with the entropy theory, several kinds of dimensions are introduced for arbitrary topological spaces. Their properties are examined, in particular, for normal spaces and quasi-discrete ones. One of the considered dimensions coincides, on these spaces, with the Čech-Lebesgue dimension and the height dimension of posets, respectively.

متن کامل

Sieving by Large Integers and Covering Systems of Congruences

An old question of Erdős asks if there exists, for each number N , a finite set S of integers greater than N and residue classes r(n) (mod n) for n ∈ S whose union is Z. We prove that if ∑ n∈S 1/n is bounded for such a covering of the integers, then the least member of S is also bounded, thus confirming a conjecture of Erdős and Selfridge. We also prove a conjecture of Erdős and Graham, that, f...

متن کامل

Randomizing Scalar Multiplication Using Exact Covering Systems of Congruences

In this paper we present a generic, uniformly randomized scalar multiplication algorithm based on covering systems of congruences, with built-in protections against various side-channel attacks. It has been tailored to resist a recent class of attacks called horizontal attacks. These very powerful attacks exploit some unsuspected weaknesses hidden in most, if not all, highly regular and constan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rocky Mountain Journal of Mathematics

سال: 1996

ISSN: 0035-7596

DOI: 10.1216/rmjm/1181072104